There Are 2א0 Many H-degrees in the Random Reals
نویسندگان
چکیده
We prove that there are 2א0 many H-degrees in the random reals.
منابع مشابه
Degrees of monotone complexity
Levin and Schnorr (independently) introduced the monotone complexity, Km(α), of a binary string α. We use monotone complexity to define the relative complexity (or relative randomness) of reals. We define a partial ordering ≤Km on 2 by α ≤Km β iff there is a constant c such that Km(α n) ≤ Km(β n) + c for all n. The monotone degree of α is the set of all β such that α ≤Km β and β ≤Km α. We show ...
متن کاملOscillation in the Initial Segment Complexity of Random Reals
We study oscillation in the prefix-free complexity of initial segments of 1-random reals. For upward oscillations, we prove that P n∈ω 2 −g(n) diverges iff (∃∞n) K(X n) > n+g(n) for every 1-random X ∈ 2ω . For downward oscillations, we characterize the functions g such that (∃∞n) K(X n) < n+g(n) for almost every X ∈ 2ω . The proof of this result uses an improvement of Chaitin’s counting theorem...
متن کاملA Basis Theorem for Π1 Classes of Positive Measure and Jump Inversion for Random Reals
We extend the Shoenfield jump inversion theorem to the members of any Π1 class P ⊆ 2 with nonzero measure; i.e., for every Σ2 set S ≥T ∅′, there is a ∆2 real A ∈ P such that A′ ≡T S. In particular, we get jump inversion for ∆2 1-random reals. 1 This paper is part of an ongoing program to study the relationship between two fundamental notions of complexity for real numbers. The first is the comp...
متن کاملWeak Diamond and Open Colorings
The purpose of this article is to prove the relative consistency of certain statements about open colorings with 2א0 < 2א1 . In particular both OCA and the statement that every 1-1 function of size א1 is σ-monotonic are consistent with 2א0 < 2א1 . As a corollary we have that 2א0 < 2א1 does not admit a Pmax variation (in the presence of an inaccessible cardinal). The open coloring axiom, OCA, is...
متن کاملThe K-Degrees, Low for K Degrees, and Weakly Low for K Sets
We call A weakly low for K if there is a c such that KA(σ) ≥ K(σ)−c for infinitely many σ; in other words, there are infinitely many strings that A does not help compress. We prove that A is weakly low for K iff Chaitin’s Ω is A-random. This has consequences in the K-degrees and the low for K (i.e., low for random) degrees. Furthermore, we prove that the initial segment prefix-free complexity o...
متن کامل